Efficient visit orders for polling systems

M/G/∞ polling systems with random visit times

We consider a polling system where a group of an infinite number of servers visits sequentially a set of queues. When visited, each queue is attended for a random time. Arrivals at each queue follow a Poisson process, and service time of each individual customer is drawn from a general probability distribution function. Thus, each of the queues comprising the system is, in isolation, an M/G/∞-t...

M/g/1 Polling Systems with Random Visit Times

We consider a polling system where a group of an infinite number of servers visits sequentially a set of queues. When visited, each queue is attended for a random time. Arrivals at each queue follow a Poisson process, and the service time of each individual customer is drawn from a general probability distribution function. Thus, each of the queues comprising the system is, in isolation, an M/G...

Dynamic visit-order rules for batch-service polling

Efficient Polling Protocol for Decentralized Social Networks

We address the polling problem in social networks where individuals collaborate to choose the most favorite choice amongst some options, without divulging their vote and publicly exposing their potentially malicious actions. Given this social interaction model, Guerraoui et al. [1], [2] recently proposed polling protocols that do not rely on any central authority or cryptography system, using a...

An efficient polling layer for SNMP

We propose the introduction of a Polling Layer that allows the efficient instrumentation of the management information models for the use of monitoring-intensive management applications. The polling layer allows to optimize the number of polling packets sent to the SNMP agents to collect management data. We describe the architecture of the polling layer that allows the management applications t...